Cross-Intersecting Families of Vectors

نویسندگان

  • János Pach
  • Gábor Tardos
چکیده

Given a sequence of positive integers p = (p1, . . . , pn), let Sp denote the family of all sequences of positive integers x = (x1, . . . , xn) such that xi ≤ pi for all i. Two families of sequences (or vectors), A,B ⊆ Sp, are said to be r-cross-intersecting if no matter how we select x ∈ A and y ∈ B, there are at least r distinct indices i such that xi = yi. We determine the maximum value of |A| · |B| over all pairs of rcross-intersecting families and characterize the extremal pairs for r ≥ 1, provided that min pi > r + 1. The case min pi ≤ r + 1 is quite different. For this case, we have a conjecture, which we can verify under additional assumptions. Our results generalize and strengthen several previous results by Berge, Borg, Frankl, Füredi, Livingston, Moon, and Tokushige, and answers a question of Zhang.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-Intersecting Sets of Vectors

Given a sequence of positive integers p = (p1, . . . , pn), let Sp denote the set of all sequences of positive integers x = (x1, . . . , xn) such that xi ≤ pi for all i. Two families of sequences (or vectors), A,B ⊆ Sp, are said to be r-cross-intersecting if no matter how we select x ∈ A and y ∈ B, there are at least r distinct indices i such that xi = yi. We show that for any pair of 1-cross-i...

متن کامل

Uniformly cross intersecting families

Let A and B denote two families of subsets of an n-element set. The pair (A,B) is said to be `-cross-intersecting iff |A∩B| = ` for all A ∈ A and B ∈ B. Denote by P`(n) the maximum value of |A||B| over all such pairs. The best known upper bound on P`(n) is Θ(2), by Frankl and Rödl. For a lower bound, Ahlswede, Cai and Zhang showed, for all n ≥ 2`, a simple construction of an `-cross-intersectin...

متن کامل

THE EIGENVALUE METHOD FOR CROSS t-INTERSECTING FAMILIES

We show that the Erdős–Ko–Rado inequality for t-intersecting families of subsets can be easily extended to an inequality for cross t-intersecting families by using the eigenvalue method. The same applies to the case of t-intersecting families of subspaces. The eigenvalue method is one of the proof techniques to get Erdős–Ko–Rado type inequalities for t-intersecting families, for example, a proo...

متن کامل

On cross-intersecting families

Frankl, P., On cross-intersecting families, Discrete Mathematics 108 (1992) 291-295. Let n 3 t z 1 be integers. Let 9, YI be families of subsets of the n-element set X. They are called cross t-intersecting if IF n GI 2 t holds for all F E 9 and G E 3. If 9 = CfI then 9 is called t-intersecting. Let m(n, t) denote the maximum possible cardinality of a r-intersecting family. Our main result says ...

متن کامل

Cross-Intersecting Families of Partial Permutations

For positive integers r and n with r ≤ n, let Pn,r be the family of all sets {(x1, y1), ..., (xr, yr)} such that x1, ..., xr are distinct elements of [n] := {1, ..., n} and y1, ..., yr are also distinct elements of [n]. Pn,n describes permutations of [n]. For r < n, Pn,r describes r-partial permutations of [n]. Families A1, ...,Ak of sets are said to be cross-intersecting if, for any distinct i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2013